Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time
نویسندگان
چکیده
منابع مشابه
Fast Approximate Distance Queries in Unweighted Graphs Using Bounded Asynchrony
We introduce a new parallel algorithm for approximate breadthfirst ordering of an unweighted graph by using bounded asynchrony to parametrically control both the performance and error of the algorithm. This work is based on the k-level asynchronous (KLA) paradigm that trades expensive global synchronizations in the level-synchronous model for local synchronizations in the asynchronous model, wh...
متن کاملImproved Distance Queries in Planar Graphs
There are several known data structures that answer distance queries between two arbitrary vertices in a planar graph. The tradeoff is among preprocessing time, storage space and query time. In this paper we present three data structures that answer such queries, each with its own advantage over previous data structures. The first one improves the query time of data structures of linear space. ...
متن کاملOptimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs
We consider data-structures for answering reachability and distance queries on constant-treewidth graphs with n nodes, on the standard RAM computational model with wordsize W = Θ(logn). Our first contribution is a data-structure that after O(n) preprocessing time, allows (1) pair reachability queries in O(1) time; and (2) single-source reachability queries in O( n logn ) time. This is (asymptot...
متن کاملGenerating Random Hyperbolic Graphs in Subquadratic Time
Complex networks have become increasingly popular for modeling various real-world phenomena. Realistic generative network models are important in this context as they simplify complex network research regarding data sharing, reproducibility, and scalability studies. Random hyperbolic graphs are a very promising family of geometric graphs with unit-disk neighborhood in the hyperbolic plane. Prev...
متن کاملRecognizing Median Graphs in Subquadratic Time
Motivated by a dynamic location problem for graphs, Chung, Graham and Saks introduced a graph parameter called windex. Graphs of windex 2 turned out to be, in graph-theoretic language, retracts of hypercubes. These graphs are also known as median graphs and can be characterized as partial binary Hamming graphs satisfying a convexity condition. In this paper an O(n 3 2 logn) algorithm is present...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2013
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2012.01.016